A New Equational Foundation for the Fluent Calculus
نویسندگان
چکیده
A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a fluent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of the existing approach. We prove that the correctness of the Fluent Calculus as a solution to the Frame Problem still holds under the new foundation. Furthermore, we extend our theory by an induction axiom needed for reasoning about integer-valued resources. Stream: Knowledge Representation and Non-monotonic Reasoning.
منابع مشابه
A New Equational Foundation for the Fluent Calculus Stream: Knowledge Representation and Non-monotonic Reasoning
A new equational foundation is presented for the Fluent Calculus , an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a uent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of the existing approach. We prove that the...
متن کاملSolving Planning Problems by Partial Deduction
We develop an abstract partial deduction method capable of solving planning problems in the Fluent Calculus. To this end, we extend \classical" partial deduction to accommodate both, equational theories and regular type information. We show that our new method is actually complete for conjunctive planning problems in the propositional Fluent Calculus. Furthermore, we believe that our approach c...
متن کاملEquational incompleteness and incomparability results for lambda calculus functional semantics
In this paper we establish the existence of a lambda theory which can be modeled in continuous semantics but neither in stable nor hypercoherent semantics. That give us a new equational incompleteness result for the stable semantics and the first one for a strongly stable semantics. We deduce the firsts equational incomparability theorems for untyped lambda calculus semantics.
متن کاملFrom Situation Calculus To Fluent Calculus: A New Motivation
While historically the Fluent Calculus arose from approaches to the Frame Problem using non-classical, linear logics, an alternative is to view it as a development of the Situation Calculus with the aim of coping with the inferential aspect of the Frame Problem. Starting oo from the concept of successor state axioms as a solution to the representational aspect, we show how by gradual improvemen...
متن کاملThe Confinement Problem in the Presence of Faults
In this paper, we establish a semantic foundation for the safe execution of untrusted code. Our approach extends Moggi’s computational λ-calculus in two dimensions with operations for asynchronous concurrency, shared state and software faults and with an effect type system à la Wadler providing fine-grained control of effects. An equational system for fault isolation is exhibited and its soundn...
متن کامل